Optimal Starting Approximations for Newton's Method
نویسنده
چکیده
Abstract. Various writers have dealt with the subject of optimal starting approximations for square-root calculation by Newton's method. Three optimality criteria that have been used can be shown to lead to closely related approximations. This fact makes it surprisingly easy to choose a starting approximation of some prescribed form so that the maximum relative error after any number of Newton iterations is as small as possible. |
منابع مشابه
Convergence of Galerkin Approximations for the Korteweg - de Vries Equation
Standard Galerkin approximations, using smooth splines on a uniform mesh, to 1-periodic solutions of the Korteweg-de Vries equation are analyzed. Optimal rate of convergence estimates are obtained for both semidiscrete and second order in time fully discrete schemes. At each time level, the resulting system of nonlinear equations can be solved by Newton's method. It is shown that if a proper ex...
متن کاملTravelling-Wave Solution of Volterra Lattice by the Optimal Homotopy Analysis Method
The travelling-wave solution of the Volterra lattice has been constructed by the optimal homotopy analysis method. The optimal method used here contains three auxiliary convergence-control parameters to adjust and control the convergence region of the solution. By minimizing the averaged residual error, the optimal convergence-control parameters can be obtained, which give much better approxima...
متن کاملA wavelet method for stochastic Volterra integral equations and its application to general stock model
In this article,we present a wavelet method for solving stochastic Volterra integral equations based on Haar wavelets. First, we approximate all functions involved in the problem by Haar Wavelets then, by substituting the obtained approximations in the problem, using the It^{o} integral formula and collocation points then, the main problem changes into a system of linear or nonlinear equation w...
متن کاملMetric Regularity of Newton's Iteration
For a version of Newton’s method applied to a generalized equation with a parameter, we extend the paradigm of the Lyusternik-Graves theorem to the framework of a mapping acting from the pair “parameter-starting point” to the set of corresponding convergent Newton’s sequences. Under ample parameterization, metric regularity of the mapping associated with convergent Newton’s sequences becomes eq...
متن کاملA new optimal method of fourth-order convergence for solving nonlinear equations
In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...
متن کامل